Termination w.r.t. Q proof of /tmp/tmpj-k-GR/4.37.trs

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

a(b(a(x))) → b(a(x))

Q is empty.

↳ QTRS

  ↳ DirectTerminationProof

Q restricted rewrite system:
The TRS R consists of the following rules:

a(b(a(x))) → b(a(x))

Q is empty.

We use [27] with the following order to prove termination.

Knuth-Bendix order [24] with precedence:

trivial

and weight map:

a_1=1
dummyConstant=1
b_1=1